Wei-type duality theorems for matroids
نویسندگان
چکیده
We present several fundamental duality theorems for matroids and more general combinatorial structures. As a special case, these results show that the maximal cardinalities of fixed-ranked sets of a matroid determine the corresponding maximal cardinalities of the dual matroid. Our main results are applied to perfect matroid designs, graphs, transversals, and linear codes over division rings, in each case yielding a duality theorem for the respective class of objects.
منابع مشابه
Generalizations of Wei's Duality Theorem
Wei’s celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two Wei-type duality theorems for new combinatorial structures that are introduced and named demi-matroids. These generalize matroids and are the appropriate com...
متن کاملTangle-tree duality: in graphs, matroids and beyond⇤
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets. Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversel...
متن کاملUnifying duality theorems for width parameters in graphs and matroids I. Weak and strong duality
We prove a general duality theorem for width parameters in combinatorial structures such as graphs and matroids. It implies the classical such theorems for path-width, tree-width, branch-width and rank-width, and gives rise to new width parameters with associated duality theorems. The dense substructures witnessing large width are presented in a unified way akin to tangles, as orientations of s...
متن کاملLinear programming duality and morphisms
In this paper we investigate a class of problems permitting a good characterisation from the point of view of morphisms of oriented matroids. We prove several morphism-duality theorems for oriented matroids. These generalize LP-duality (in form of Farkas’ Lemma) and Minty’s Painting Lemma. Moreover, we characterize all morphism duality theorems, thus proving the essential unicity of Farkas’ Lem...
متن کاملUnifying duality theorems for width parameters in graphs and matroids II. General duality
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 62 شماره
صفحات -
تاریخ انتشار 2012